Subsequences of sequences of random variables
نویسندگان
چکیده
منابع مشابه
Subsequences of Sequences of Random Variables
Chatterji [2] has formulated the following heuristic principle: given any limit property for independent identically distributed random variables (i.i.d.r.v.'s), there exists an analogous property such that an arbitrary sequence of r.v.'s always has some subsequence possessing this analogous property. By 'arbitrary', we mean that no assumption concerning dependence is made, though it may be nec...
متن کاملOrlicz Norms of Sequences of Random Variables
Let fi, i = 1, . . . , n, be copies of a random variable f and N be an Orlicz function. We show that for every x ∈ R the expectation E‖(xifi)i=1‖N is maximal (up to an absolute constant) if fi, i = 1, . . . , n, are independent. In that case we show that the expectation E‖(xifi)i=1‖N is equivalent to ‖x‖M , for some Orlicz function M depending on N and on distribution of f only. We provide appl...
متن کاملRamsey Theory and Sequences of Random Variables
We consider probability spaces which contain a family {EA : A ⊆ {1, 2, . . . , n}, |A| = k} of events indexed by the k-element subsets of {1, 2, . . . , n}. A pair (A,B) of k-element subsets of {1, 2, . . . , n} is called a shift pair if the largest k − 1 elements of A coincide with the smallest k − 1 elements of B. For a shift pair (A,B), Pr[AB] is the probability that event EA is true and EB ...
متن کاملHeapable Sequences and Subsequences
Let us call a sequence of numbers heapable if they can be sequentially inserted to form a binary tree with the heap property, where each insertion subsequent to the first occurs at a previously placed number. In this paper we consider a variety of problems related to heapable sequences and subsequences that do not appear to have been studied previously. Our motivation for introducing these conc...
متن کاملOn random subsequences of {nα}
By a classical result of Philipp (1977), for any positive sequence (nk)k≥1 satisfying the Hadamard gap condition, the discrepancy of (nkx)1≤k≤N mod 1 satisfies the law of the iterated logarithm. For sequences (nk)k≥1 growing subexponentially this result becomes generally false and the asymptotic behavior of the discrepancy remains unknown. In this paper we show that for randomly sampled subsequ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1977
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1977-14208-0